On simplifying ‘incremental remap’–based transport schemes
نویسندگان
چکیده
منابع مشابه
On simplifying 'incremental remap'-based transport schemes
The flux-form incremental remapping transport scheme introduced by Dukowicz and Baumgardner [1] converts the transport problem into a remapping problem. This involves identifying overlap areas between quadrilateral flux-areas and regular square grid cells which is non-trivial and leads to some algorithm complexity. In the simpler swept area approach (originally introduced by Hirt et al. [2]) th...
متن کاملIncremental File Reorganization Schemes
For many files, reorganization is essential during their lifetime in order to maintain an adequate performance level for users. File reorganization can be defined as the process of changing the physical structure of the file. In this paper we are mainly concerned with changes in the placement of records of a file on pages in secondary storage. We model the problem of file reorganization in term...
متن کاملSimplifying Design and Analysis of Complex Predicate Encryption Schemes
Wee (TCC’14) and Attrapadung (Eurocrypt’14) introduced predicate and pair encodings, respectively, as a simple way to construct and analyze attribute-based encryption schemes, or more generally predicate encryption. However, many schemes do not satisfy the simple information theoretic property proposed in those works, and thus require much more complicated analysis. In this paper, we propose a ...
متن کاملSome considerations for high-order ‘incremental remap’-based transport schemes: edges, reconstructions, and area integration
The problem of two-dimensional tracer advection on the sphere is extremely important in modeling of geophysical fluids and has been tackled using a variety of approaches. A class of popular approaches for tracer advection include ‘incremental remap’ or cell-integrated semi-Lagrangian-type schemes. These schemes achieve high-order accuracy without the need for multistage integration in time, are...
متن کاملIncremental Checkpoint Schemes for Weibull Failure Distribution
Incremental checkpoint mechanism was introduced to reduce high checkpoint overhead of regular (full) checkpointing, especially in high-performance computing systems. To gain an extra advantage from the incremental checkpoint technique, we propose an optimal checkpoint frequency function that globally minimizes the expected wasted time of the incremental checkpoint mechanism. Also, the re-comput...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computational Physics
سال: 2011
ISSN: 0021-9991
DOI: 10.1016/j.jcp.2011.06.030